package project.euler.honk.problem.to50;

import java.math.BigInteger;
import java.util.HashSet;

final class Problem29 {

	private static final int SIZE = 100;

	public static void main(String[] args) {
		long start = System.currentTimeMillis();
		final HashSet<BigInteger> set = new HashSet<BigInteger>();

		for (int a = 2; a <= SIZE; a++) {
			for (int b = 2; b <= SIZE; b++) {
				BigInteger i = BigInteger.valueOf(a).pow(b);
				set.add(i);
			}
		}
		int count = set.size();
		long end = System.currentTimeMillis();
		System.out.println("Result: " + count + " Time: " + (end - start));
	}

}
